Logspace Mitoticity
نویسنده
چکیده
We study the relation of autoreducibility and mitoticity for polylog-space many-one reductions and log-space many-one reductions. For polylog-space these notions coincide, while proving the same for log-space is out of reach. More precisely, we show the following results with respect to nontrivial sets and many-one reductions. 1. polylog-space autoreducible ⇔ polylog-space mitotic 2. log-space mitotic ⇒ log-space autoreducible ⇒ (logn · log logn)-space mitotic 3. relative to an oracle, log-space autoreducible ⇒ log-space mitotic
منابع مشابه
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
We study the autoreducibility and mitoticity of complete sets for NP and other complexity classes, where the main focus is on logspace reducibilities. In particular, we obtain: • For NP and all other classes of the PH: each ≤ m -complete set is ≤ log T -autoreducible. • For P, ∆pk, NEXP: each ≤ m -complete set is a disjoint union of two ≤ log 2-tt-complete sets. • For PSPACE: each ≤pdtt-complet...
متن کاملNon-mitotic Sets
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility and m-reducibility differ on NP. • There exist non-T-autoreducible sets in NP (by a result from Ambos-Spies, these sets are neither T-mitotic nor m-mitotic). • T-autoreducibility and T-mitoticity differ on NP (this contrasts...
متن کاملAutoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
We investigate the autoreducibility and mitoticity of complete sets for several classes with respect to different polynomial-time and logarithmic-space reducibility notions. Previous work in this area focused on polynomial-time reducibility notions. Here we obtain new mitoticity and autoreducibility results for the classes EXP and NEXP with respect to some restricted truth-table reductions (e.g...
متن کاملComplexity Theory Column 64
Autoreducibility and mitoticity express weak forms of redundancy of information that a set might possess. We describe many results known about these concepts. Mitoticity always implies autoreducibility, but the converse holds in some situations and fails in others. Among the results we describe are that NP-complete sets are many-one autoreducible and that every many-one autoreducible set is man...
متن کاملA reduction of the logspace shortest path problem to biconnected graphs
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007